Variable neighborhood search based algorithms for crossdock truck assignment
نویسندگان
چکیده
To operate a cross-dock successfully, an efficient assignment of trucks to docks is one the key decisions. In this paper, we are interested in problem, where number exceeds docks. The objective minimize cost transferring goods within while avoiding delivery penalties. This problem being NP-hard, use Variable Neighborhood Search metaheurisitc (VNS) solve it approximately. More specifically, conduct structured empirical study compare several VNS configurations and find which is/are most effective for problem. work, first analyze way search strategy neighborhood operators can be combined framework according their efficiency local search. Then best tested three variants, namely Basic (BVNS), General (GVNS) using VND (B-VND) GVNS Union (U-VND) used order applying these operators. Finally evaluate influence stopping criterion variants. Some significant differences among shown illustrated by conducting Friedman test.
منابع مشابه
Variable Neighborhood Search based algorithms for high school timetabling
This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions around the world and attracted seventeen competitors. Some of the VNS algorithm variants were ab...
متن کاملApplying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system
Different from warehouse, crossdock is considered as a ‘‘JIT’’ technique in logistics and supply chain management (LSCM), which is usually a short period of time to store cargos. Since cargos transported to a crossdock by inbound trucks are immediately sorted out, repackaged, routed and loaded into outbound trucks and then delivered to customers within one day, one of the key issues to operate ...
متن کاملVariable Neighborhood Search for the University Lecturer-Student Assignment Problem
The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to scientific topics which are proposed and supported by members of staff. The problem involves the optimization under given preferences of students which may ...
متن کاملVariable Neighborhood Search for the Minimum Interference Frequency Assignment Problem
The frequency assignment is an important task in the design of radio network. Let us concider a GSM network N composed of a set of nc cells: C= {C1, C2 . . . Ci, . . . Cnc}. Each cell required a number of frequencies which is defined by the number of transceivers TRX or traffic demand Di= {1, 2 . . . , x}An interval of operational frequencies: [Fmax − Fmin]. Further, consider a matrix: MCo[nc][...
متن کاملVariable Neighborhood Search Methods
Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2020087